On Indexed Data Broadcast

On Indexed Data Broadcast

18 which we denote by (j) and which does not depend on t as desired. Finally we have: TUNE n X j=1 p j max t T(t; j) n X j=1 p j r(j) = n X j=1 p j r(h + 2(q ? 1)(log q d (j) + 1)) n X j=1 p j r(h + 2(q ? 1)(log q 2d j + 1)) n X j=1 p j r(h + 2q(log q d j + 1)) = 2qr(log q n X j=1 p p j + n X j=1 p j log q 1 p p j) + (h + 2q)r 4qr log q n X j=1 p p j + (h + 2q)r where the third inequality follo...

Power-aware data retrieval protocols for indexed broadcast parallel channels

In pervasive and mobile computing environments, “timely and reliable” access to public data requires methods that allow quick, efficient, and low-power access to information to overcome technological limitations of wireless communication and access devices. Literature suggests broadcasting (one-way communication) as an effective way to disseminate the public data to mobile devices. Within the s...

Type - indexed data

Type-Indexed Data Types

A polytypic function is a function that can be instantiated on many data types to obtain data type speci c functionality. Examples of polytypic functions are the functions that can be derived in Haskell, such as show , read , and ( ). More advanced examples are functions for digital searching, pattern matching, uni cation, rewriting, and structure editing. For each of these problems, we not onl...

Fast Data Access on Multiple Broadcast Channels

This paper gives an overview on techniques for quickly finding items that are broadcast on multiple data channels. Previous works assume that throughput increases with the number of data channels because the total available bandwidth increases. This assumption, however, rests on the client’s ability read data as soon as it is broadcast on any channel. Without this ability, the benefit of additi...